A simple characterization of sets satisfying the Central Sets Theorem
نویسندگان
چکیده
Central subsets of a discrete semigroup S have very strong combinatorial properties which are a consequence of the Central Sets Theorem. Call a set a C-set if it satisfies the conclusion of the Central Sets Theorem. We obtain here a reasonably simple characterization of C-sets in an arbitrary discrete semigroup.
منابع مشابه
Central Sets and Their Combinatorial Characterization
Central sets in semigroups are known to have very rich combinatorial structure, described by the “Central Sets Theorem”. It has been unknown whether the Central Sets Theorem in fact characterizes central sets, and if not whether some other combinatorial characterization could be found. We derive here a combinatorial characterization of central sets and of the weaker notion of quasi-central sets...
متن کاملSeparated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کاملSmall Sets Satisfying the Central Sets Theorem
The Central Sets Theorem is a powerful theorem, one of whose consequences is that any central set in N contains solutions to any partition regular system of homogeneous linear equations. Since at least one set in any finite partition of N must be central, any of the consequences of the Central Sets Theorem must be valid for any partition of N. It is a result of Beiglböck, Bergelson, Downarowicz...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کامل?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...
متن کامل